An Undecidable Property of Recurrent Double Sequences
نویسنده
چکیده
For an arbitrary finite algebra (A, f(·, ·), 0, 1) one defines a double sequence a(i, j) by a(i, 0) = a(0, j) = 1 and a(i, j) = f(a(i, j − 1), a(i − 1, j)). The problem if such recurrent double sequences are ultimately zero is undecidable, even if we restrict it to the class of commutative finite algebras. A.M.S.-Classification: 03D10.
منابع مشابه
On detectability of labeled Petri nets with inhibitor arcs
Detectability is a basic property of dynamic systems: when it holds one can use the observed output signal produced by a system to reconstruct its current state. In this paper, we consider properties of this type in the framework of discrete event systems modeled by Petri nets (a.k.a. place/transition nets). We first study weak detectability and weak approximate detectability. The former implie...
متن کامل$mathcal{I}_2$-convergence of double sequences of\ fuzzy numbers
In this paper, we introduce and study the concepts of $mathcal{I}_2$-convergence, $mathcal{I}_2^{*}$-convergence for double sequences of fuzzy real numbers, where $mathcal{I}_2$ denotes the ideal of subsets of $mathbb N times mathbb N$. Also, we study some properties and relations of them.
متن کاملA Tauberian theorem for $(C,1,1)$ summable double sequences of fuzzy numbers
In this paper, we determine necessary and sufficient Tauberian conditions under which convergence in Pringsheim's sense of a double sequence of fuzzy numbers follows from its $(C,1,1)$ summability. These conditions are satisfied if the double sequence of fuzzy numbers is slowly oscillating in different senses. We also construct some interesting double sequences of fuzzy numbers.
متن کاملWijsman Statistical Convergence of Double Sequences of Sets
In this paper, we study the concepts of Wijsman statistical convergence, Hausdorff statistical convergence and Wijsman statistical Cauchy double sequences of sets and investigate the relationship between them.
متن کاملOrbits of Linear Maps and Regular Languages
We settle the equivalence between the problem of hitting a polyhedral set by the orbit of a linear map and the intersection of a regular language and a language of permutations of binary words (PB-realizability problem). The decidability of the both problems is presently unknown and the first one is a straightforward generalization of the famous Skolem problem and the nonnegativity problem in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 49 شماره
صفحات -
تاریخ انتشار 2008